منابع مشابه
Frame packing in real-time communication
A common computational model in distributed embedded systems is that the nodes exchange signals via a network. Most often a signal represents the state of some physical device and has a signal size ranging from a single bit up to a few bytes. Furthermore, each signal typically has a deadline requirement. The communication networks used are often based on a broadcast bus where fixed or variable ...
متن کاملFrame Packing in Real - Time Communication - Technical report
A common computational model in distributed embedded systems is that the nodes exchange signals via a network. Most often a signal represents the state of some physical device and has a signal size ranging from a single bit up to a few bytes. Furthermore, each signal typically has a deadline requirement. The communication networks used are often based on a broadcast bus where fixed or variable ...
متن کاملDiscrete-Time Scheduling under Real-Time Constraints
We introduce a new method for scheduling under real-time constraints that is suitable for synchronous system implementations. The input specification is in the form of timing diagrams in which the occurrence times of signal transitions or actions are related by linear constraints, expressing the assumptions on the input actions (the environment) and the commitments on the output actions. Provid...
متن کاملReal-Time Scheduling Under Time-Interval Constraints
This paper presents a new task model where jobs are divided into segments A, B and C. Segment B has a specific time-interval where it should execute to fulfill some application constraints. We consider the execution of B as valid if performed inside that time-interval, otherwise, its contribution may be valueless to its task. We adapt some scheduling approaches from the literature and present a...
متن کاملPacking under Tolerance Constraints Technische Universit at M Unchen Packing under Tolerance Constraints (preliminary Version)
Let N = f1; 2; : : : ; ng and c 2 Rn: A k-tuple (t1; : : : ; tk) of elements in N is called an acceptable cell if 1 k Xi=1 cti 1: We consider the problems of (i) nding the set T of all acceptable cells e ciently (ii) nding a maximum number of mutually disjoint acceptable cells. The latter problem is called k-packing under tolerance constraints. For both problems, heuristics and exact solution a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC Proceedings Volumes
سال: 2003
ISSN: 1474-6670
DOI: 10.1016/s1474-6670(17)32482-5